On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
نویسندگان
چکیده
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
منابع مشابه
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
We analyze the properties of probabilistic reversible decide-and-halt automata (DHPRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DHPRA by proving that two ‘‘forbidden’’ constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown...
متن کاملOn languages not recognizable by One-way Measure Many Quantum Finite automaton
Measure Many Quantum Finite Automaton is not the strongest known model of quantum automaton but, it is still an open question what is the class of languages recognized by it when only bounded error probability is allowed. In this paper a natural class of ”word set” regular languages are studied. A proof that in general case the class can not be recognized by One-way model of Measure Many Quantu...
متن کاملOn the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeter-ministic and probabilistic 1-way and 2-way nite state automata. We prove the following facts regarding 2qfa's. 1. For any > 0, there is a 2qfa M which recognizes the non-regular language L = fa m b m j m 1g with (one-sided) error bounded by , an...
متن کاملOn Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملLanguages Recognized with Unbounded Error by Quantum Finite Automata
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded error setting: One-way automata of this kind recognize all and only the stochastic languages. When the tape head is allowed two-way (or even " 1.5-way ") movement, more languages become recognizable. This leads to the conclusion that quantum Turing machines are more powe...
متن کامل